Continuous Curvelet Transform: I. Resolution of the Wavefront Set
نویسندگان
چکیده
We discuss a Continuous Curvelet Transform (CCT), a transform f → Γf (a, b, θ) of functions f(x1, x2) on R , into a transform domain with continuous scale a > 0, location b ∈ R, and orientation θ ∈ [0, 2π). The transform is defined by Γf (a, b, θ) = 〈f, γabθ〉 where the inner products project f onto analyzing elements called curvelets γabθ which are smooth and of rapid decay away from an a by √ a rectangle with minor axis pointing in direction θ. We call them curvelets because this anisotropic behavior allows them to ‘track’ the behavior of singularities along curves. They are continuum scale/space/orientation analogs of the discrete frame of curvelets discussed in Candès and Donoho (2002). We use the CCT to analyze several objects having singularities at points, along lines, and along smooth curves. These examples show that for fixed (x0, θ0), Γf (a, x0, θ0) decays rapidly as a → 0 if f is smooth near x0, or if the singularity of f at x0 is oriented in a different direction than θ0. Generalizing these examples, we state general theorems showing that decay properties of Γf (a, x0, θ0) for fixed (x0, θ0), as a → 0 can precisely identify the wavefront set and the Hwavefront set of a distribution. In effect, the wavefront set of a distribution is the closure of the set of (x0, θ0) near which Γf (a, x, θ) is not of rapid decay as a → 0; the H-wavefront set is the closure of those points (x0, θ0) where the ‘directional parabolic square function’ S(x, θ) = (∫ |Γf (a, x, θ)| da a3+2m )1/2 is not locally integrable. The CCT is closely related to a continuous transform used by Hart Smith in his study of Fourier Integral Operators. Smith’s transform is based on strict affine parabolic scaling of a single mother wavelet, while for the transform we discuss, the generating wavelet changes (slightly) scale by scale. The CCT can also be compared to the FBI (FourierBros-Iagolnitzer) and Wave Packets (Cordoba-Fefferman) transforms. We describe their similarities and differences in resolving the wavefront set.
منابع مشابه
Resolution of the Wavefront Set Using Continuous Shearlets
It is known that the Continuous Wavelet Transform of a distribution f decays rapidly near the points where f is smooth, while it decays slowly near the irregular points. This property allows the identification of the singular support of f . However, the Continuous Wavelet Transform is unable to describe the geometry of the set of singularities of f and, in particular, identify the wavefront set...
متن کاملDiscrete Curvelet Transform Based Super-resolution using Sub-pixel Image Registration
All the time, there is a demand of High-Resolution (HR) images in electronic imaging applications. Super-Resolution (SR) is an approach used to restore High-Resolution (HR) image from one or more Low-Resolution (LR) images. The goal of SR is to extract the independent information from each LR image in that set and combine the information into a single high resolution (HR) image. The quality of ...
متن کاملNovel Automated Method for Minirhizotron Image Analysis: Root Detection using Curvelet Transform
In this article a new method is introduced for distinguishing roots and background based on their digital curvelet transform in minirhizotron images. In the proposed method, the nonlinear mapping is applied on sub-band curvelet components followed by boundary detection using energy optimization concept. The curvelet transform has the excellent capability in detecting roots with different orient...
متن کاملAnalysis of Singularities and Edge Detection using the Shearlet Transform
The continuous curvelet and shearlet transforms have recently been shown to be much more effective than the traditional wavelet transform in dealing with the set of discontinuities of functions and distributions. In particular, the continuous shearlet transform has the ability to provide a very precise geometrical characterization of general discontinuity curves occurring in images. In this pap...
متن کاملCurvelet Based Efficient Image Compression Technique by Spiht with PSO
In recent years, Curvelet Transform is the most preferred technique for image compression. It is proposed that an efficient and fast image compression scheme based on all level curvelet coefficients with SPIHT (Set Partitioning in Hierarchical Trees).After many passes of coding with SPIHT, it degrades the coding performance.There was a need of a transform that handles two dimensional singularit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003